On the Chung-Diaconis-Graham random process
نویسندگان
چکیده
منابع مشابه
A lower bound for the Chung-Diaconis-Graham random process
Chung, Diaconis, and Graham considered random processes of the form Xn+1 = anXn + bn (mod p) where p is odd, X0 = 0, an = 2 always, and bn are i.i.d. for n = 0, 1, 2, . . .. In this paper, we show that if P (bn = −1) = P (bn = 0) = P (bn = 1) = 1/3, then there exists a constant c > 1 such that c log2 p steps are not enough to make Xn get close to uniformly distributed on the integers mod p.
متن کاملOn the Chung-diaconis-graham Random Pro- Cess
Abstract Chung, Diaconis, and Graham considered random processes of the form Xn+1 = 2Xn + bn (mod p) where X0 = 0, p is odd, and bn for n = 0, 1, 2, . . . are i.i.d. random variables on {−1, 0, 1}. If Pr(bn = −1) = Pr(bn = 1) = β and Pr(bn = 0) = 1− 2β, they asked which value of β makes Xn get close to uniformly distributed on the integers mod p the slowest. In this paper, we extend the results...
متن کاملOn a Question of Chung, Diaconis, and Graham
Chung, Diaconis, and Graham considered random processes of the form Xn+1 = 2Xn + bn (mod p) where X0 = 0, p is odd, and bn for n = 0, 1, 2, . . . are i.i.d. random variables on {−1, 0, 1}. If Pr(bn = −1) = Pr(bn = 1) = β and Pr(bn = 0) = 1 − 2β, they asked which value of β makes Xn get close to uniformly distributed on the integers mod p the slowest. In this paper, we extend the results of Chun...
متن کاملChung Graham scribe : Chris Calabro
Sometimes the edge set of an undirected graph is defined as a collection of doubleton subsets of the vertex set V . To unify the discussion, we will adopt the convention that the edge set E of a digraph G is a subset of V 2 and that G is undirected iff ∀i, j ∈ V ((i, j) ∈ E ↔ (j, i) ∈ E). Let G = (V,E) be a digraph with V = [n] = {1, . . . , n}. We can associate with G its adjacency matrix adj(...
متن کاملOn the Diaconis-Shahshahani Method in Random Matrix Theory
If is a random variable with values in a compact matrix group K , then the traces Tr( j ) ( j ∈ N) are real or complex valued random variables. As a crucial step in their approach to random matrix eigenvalues, Diaconis and Shahshahani computed the joint moments of any fixed number of these traces if is distributed according to Haar measure and if K is one of Un, On or Spn , where n is large eno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2006
ISSN: 1083-589X
DOI: 10.1214/ecp.v11-1237